Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f1(0) -> true
f1(1) -> false
f1(s1(x)) -> f1(x)
if3(true, s1(x), s1(y)) -> s1(x)
if3(false, s1(x), s1(y)) -> s1(y)
g2(x, c1(y)) -> c1(g2(x, y))
g2(x, c1(y)) -> g2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f1(0) -> true
f1(1) -> false
f1(s1(x)) -> f1(x)
if3(true, s1(x), s1(y)) -> s1(x)
if3(false, s1(x), s1(y)) -> s1(y)
g2(x, c1(y)) -> c1(g2(x, y))
g2(x, c1(y)) -> g2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

G2(x, c1(y)) -> G2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))
G2(x, c1(y)) -> G2(x, y)
G2(x, c1(y)) -> IF3(f1(x), c1(g2(s1(x), y)), c1(y))
G2(x, c1(y)) -> G2(s1(x), y)
G2(x, c1(y)) -> F1(x)
F1(s1(x)) -> F1(x)

The TRS R consists of the following rules:

f1(0) -> true
f1(1) -> false
f1(s1(x)) -> f1(x)
if3(true, s1(x), s1(y)) -> s1(x)
if3(false, s1(x), s1(y)) -> s1(y)
g2(x, c1(y)) -> c1(g2(x, y))
g2(x, c1(y)) -> g2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

G2(x, c1(y)) -> G2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))
G2(x, c1(y)) -> G2(x, y)
G2(x, c1(y)) -> IF3(f1(x), c1(g2(s1(x), y)), c1(y))
G2(x, c1(y)) -> G2(s1(x), y)
G2(x, c1(y)) -> F1(x)
F1(s1(x)) -> F1(x)

The TRS R consists of the following rules:

f1(0) -> true
f1(1) -> false
f1(s1(x)) -> f1(x)
if3(true, s1(x), s1(y)) -> s1(x)
if3(false, s1(x), s1(y)) -> s1(y)
g2(x, c1(y)) -> c1(g2(x, y))
g2(x, c1(y)) -> g2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F1(s1(x)) -> F1(x)

The TRS R consists of the following rules:

f1(0) -> true
f1(1) -> false
f1(s1(x)) -> f1(x)
if3(true, s1(x), s1(y)) -> s1(x)
if3(false, s1(x), s1(y)) -> s1(y)
g2(x, c1(y)) -> c1(g2(x, y))
g2(x, c1(y)) -> g2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


F1(s1(x)) -> F1(x)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( F1(x1) ) = max{0, x1 - 1}


POL( s1(x1) ) = x1 + 2



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f1(0) -> true
f1(1) -> false
f1(s1(x)) -> f1(x)
if3(true, s1(x), s1(y)) -> s1(x)
if3(false, s1(x), s1(y)) -> s1(y)
g2(x, c1(y)) -> c1(g2(x, y))
g2(x, c1(y)) -> g2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

G2(x, c1(y)) -> G2(x, y)
G2(x, c1(y)) -> G2(s1(x), y)

The TRS R consists of the following rules:

f1(0) -> true
f1(1) -> false
f1(s1(x)) -> f1(x)
if3(true, s1(x), s1(y)) -> s1(x)
if3(false, s1(x), s1(y)) -> s1(y)
g2(x, c1(y)) -> c1(g2(x, y))
g2(x, c1(y)) -> g2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


G2(x, c1(y)) -> G2(x, y)
G2(x, c1(y)) -> G2(s1(x), y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( G2(x1, x2) ) = max{0, x2 - 1}


POL( c1(x1) ) = x1 + 2



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f1(0) -> true
f1(1) -> false
f1(s1(x)) -> f1(x)
if3(true, s1(x), s1(y)) -> s1(x)
if3(false, s1(x), s1(y)) -> s1(y)
g2(x, c1(y)) -> c1(g2(x, y))
g2(x, c1(y)) -> g2(x, if3(f1(x), c1(g2(s1(x), y)), c1(y)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.